aks algorithm造句

• S . Ramakrishnan and S . K . Sen, Scope of conventional prime testing against polynomial-time AKS Algorithms : Matlab codes, Presented at the 6th Internl.
• The AKS algorithm evaluates this congruence for a large set of " a " values, whose size is polynomial to the digits of " n ".
• For larger inputs, the performance of the ( also unconditionally correct ) ECPP can output a primality certificate that allows independent and rapid verification of the results, which is not possible with the AKS algorithm.
• The proof of validity of the AKS algorithm shows that one can find an " r " and a set of " a " values with the above properties such that if the congruences hold then " n " is a power of a prime.
• In response to some of these variants, and to other feedback, the paper " PRIMES is in P " was updated with a new formulation of the AKS algorithm and of its proof of correctness . ( This version was eventually published in " Annals of Mathematics " . ) While the basic idea remained the same, " r " was chosen in a new manner, and the proof of correctness was more coherently organized.